Routing by distributed recursive computation and information reuse

In a networking environment, Quality-of-Service (QoS) routing plays an important role in the provision of real-time services with guaranteed throughput and bounded end-to-end delay. Its task is to nd a routing path which has su cient resources to support the requirements imposed by the applications. We propose several distributed algorithms for bandwidth-constrained routing and delay-constrained routing. The algorithms are presented in the form of distributed recursive computation (DRC). DRC computes the global routing state in a distributed, recursive fashion and often leaves useful information at intermediate nodes during the process. Information-reuse schemes are studied to utilize such information in order to reduce the overall overhead.